منابع مشابه
Hierarchical termination revisited
During the past two decades, term rewriting has gained enormous importance in various fields of computer science. Among other things, term rewriting constitutes a Turing-complete computational model which is closely related to functional programming. In other words, term rewriting systems (TRSs) can be viewed as programs. It is a well-known programming paradigm in computer science that programs...
متن کاملTermination of narrowing revisited
This paper describes several classes of term rewriting systems (TRS’s) where narrowing has a finite search space and is still (strongly) complete as a mechanism for solving reachability goals. These classes do not assume confluence of the TRS. We also ascertain purely syntactic criteria that suffice to ensure the termination of narrowing and include several subclasses of popular TRS’s such as r...
متن کاملSimple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpliication order. The basic ingredient of a simpliication order is the subterm property, but in the literature two diierent deenitions are given: one based on (strict) partial orders and another one based on preorders (or quasi-or...
متن کاملTermination of Lazy Rewriting Revisited
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to context-sensitive rewriting, reductions at such argument positions are not completely forbidden but delayed. Based on the observation that the only existing (non-trivial) approach to prove termination of such lazy rewr...
متن کاملTermination Analysis of CHR Revisited
Today, there exist two distinct direct approaches to prove termination of CHR programs. Both are applicable on separate classes of CHR programs. One approach, by T. Frühwirth, proves termination of CHR programs without propagation rules. A second approach deals with CHR programs with propagation rules. Due to its extended scope to such programs, it fails to prove termination for a class of CHR ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Engineering Economist
سال: 1996
ISSN: 0013-791X,1547-2701
DOI: 10.1080/00137919608967493